منابع مشابه
determinant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولComplexity of a {0, 1}-matrix problem
We consider the following problem: given an n × m {0, 1}-matrix M and an integer k, is it possible to get the all-zeros-matrix by merging at most k neighbouring rows or columns? Here, merging means to perform a component-wise AND operation. We prove that this problem is NP-hard but fixed-parameter tractable (taking k as parameter we show that there is an O(2.6181 ∗n ∗m) algorithm) and factor-3-...
متن کامل0 MDP 1 . 0 : Matrix Distributed Processing
This is a tutorial to explain the usage and the characteristics of MDP 1.0, a collection of Object Oriented tools (classes and functions written in C++ and based on Message Passing Interface) for generic lattice simulations on a single PC, on a cluster or on a parallel computer. Some applications in electromagnetism, electronics and condensed matter are given. A full application for Lattice QCD...
متن کامل4 Approximating the Permanent of a 0 - 1 Matrix
We have some (usually exponentially large) set V of size Z, and we wish to know how many elements are contained in some subset S (which represents elements with some property we are interested in counting). A Monte Carlo method for approximating the size of S is to pick k elements uniformly at random from V and see how many are also contained in S. If q elements are contained in S, then return ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1978
ISSN: 0024-3795
DOI: 10.1016/0024-3795(78)90018-6